Non-commutative Krull Monoids: a Divisor Theoretic Approach and Their Arithmetic

نویسنده

  • ALFRED GEROLDINGER
چکیده

A (not necessarily commutative) Krull monoid—as introduced by Wauters—is defined as a completely integrally closed monoid satisfying the ascending chain condition on divisorial two-sided ideals. We study the structure of these Krull monoids, both with ideal theoretic and with divisor theoretic methods. Among others we characterize normalizing Krull monoids by divisor theories. Based on these results we give a criterion for a Krull monoid to be a bounded factorization monoid, and we provide arithmetical finiteness results in case of normalizing Krull monoids with finite Davenport constant.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Delta Sets and Their Realizable Subsets in Krull Monoids with Cyclic Class Groups

Let M be a commutative cancellative monoid. The set ∆(M), which consists of all positive integers which are distances between consecutive irreducible factorization lengths of elements in M , is a widely studied object in the theory of nonunique factorizations. If M is a Krull monoid with divisor class group Zn, then it is well-known that ∆(M) ⊆ {1, 2, . . . , n − 2}. Moreover, equality holds fo...

متن کامل

A module theoretic approach to‎ ‎zero-divisor graph with respect to (first) dual

Let $M$ be an $R$-module and $0 neq fin M^*={rm Hom}(M,R)$. We associate an undirected graph $gf$ to $M$ in which non-zero elements $x$ and $y$ of $M$ are adjacent provided that $xf(y)=0$ or $yf(x)=0$. Weobserve that over a commutative ring $R$, $gf$ is connected anddiam$(gf)leq 3$. Moreover, if $Gamma (M)$ contains a cycle,then $mbox{gr}(gf)leq 4$. Furthermore if $|gf|geq 1$, then$gf$ is finit...

متن کامل

On the Asymptotic Values of Length Functions in Krull and Finitely Generated Commutative Monoids

Let M be a commutative cancellative atomic monoid. We consider the behavior of the asymptotic length functions ̄̀(x) and L̄(x) on M . If M is finitely generated and reduced, then we present an algorithm for the computation of both ̄̀(x) and L̄(x) where x is a nonidentity element of M . We also explore the values that the functions ̄̀(x) and L̄(x) can attain when M is a Krull monoid with torsion diviso...

متن کامل

Erdős-Zaks all divisor sets

Let Zn be the finite cyclic group of order n and S ⊆ Zn. We examine the factorization properties of the Block Monoid B(Zn, S) when S is constructed using a method inspired by a 1990 paper of Erdős and Zaks. For such a set S, we develop an algorithm in Section 2 to produce and order a set {Mi} i=1 which contains all the non-primary irreducible Blocks (or atoms) of B(Zn, S). This construction yie...

متن کامل

On Minimal Distances in Krull Monoids with Infinite Class Group

Let H be a Krull monoid with infinite class group such that each divisor class contains a prime divisor. We show that for every positive integer n, there exists a divisor closed submonoid S of H such that min∆(S) = n.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012